Facets for the cut cone II: Clique-web inequalities
نویسندگان
چکیده
منابع مشابه
Facets for the cut cone II: Clique-web inequalities
We study new classes of facets for the cut cone C, generated by the cuts of the complete graph on n vertices. This cone can also be interpreted as the cone of all semi-metrics on n points that are isometrically l~-embeddable and, in fact, the study of the facets of the cut polytope is in some sense equivalent to the study of the facets of C~. These new facets belong to the class of clique-web i...
متن کاملFacets for the cut cone I
We study facets of the cut cone C,, i.e., the cone of dimension 1⁄2n(n 1) generated by the cuts of the complete graph on n vertices. Actually, the study of the facets of the cut cone is equivalent in some sense to the study of the facets of the cut polytope. We present several operations on facets and, in particular, a "'lifting" procedure for constructing facets of C~ +1 from given facets of t...
متن کاملThe cut cone III: On the role of triangle facets
The cut polytope P. is the convex hull of the incidence vectors of the cuts (i.e. complete bipartite subgraphs) of the complete graph on n nodes. A well known class of facets of P. arises from the triangle inequalities: x o + Xlk + X~k < 2 and xlj -x~k -xjk < 0 for 1 < i, j, k < n. Hence, the metric polytope M., defined as the solution set of the triangle inequalities, is a relaxation of P.. We...
متن کاملNew facets and a branch-and-cut algorithm for the weighted clique problem
We consider a polyhedral approach to the weighted maximal b-clique problem. Given a nodeand edge-weighted complete graph the problem is to find a complete subgraph (clique) with no more than b nodes such that the sum of the weights of all nodes and edges in the clique is maximal. We introduce four new classes of facet defining inequalities for the associated bclique polytope. One of these inequ...
متن کاملThe clique partitioning problem: Facets and patching facets
The clique partitioning problem (CPP) can be formulated as follows: Given is a complete graph G = (V, E), with edge weights wij ∈ R for all {i, j} ∈ E. A subset A ⊆ E is called a clique partition if there is a partition of V into nonempty, disjoint sets V1, . . . , Vk , such that each Vp (p = 1, . . . ,k) induces a clique (i.e., a complete subgraph), and A = ∪ p=1 {{i, j}|i, j ∈ Vp , i ≠ j}. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 1992
ISSN: 0025-5610,1436-4646
DOI: 10.1007/bf01580898